Regularity Of Cubic Graph With Application
نویسندگان
چکیده
منابع مشابه
dynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولGraph editing problems with extended regularity constraints
Graph editing problems offer an interesting perspective on suband supergraph identification problems for a large variety of target properties. They have also attracted significant attention in recent years, particularly in the area of parameterized complexity as the problems have rich parameter ecologies. In this paper we examine generalisations of the notion of editing a graph to obtain a regu...
متن کاملRegularity Index of Uncertain Graph
ith the increasingly development of system complexity, there is a variety of uncertainties in the practical applications of graph theory. In this paper, the uncertainty theory is applied to study the regularity of the uncertain graph. Based on the uncertainty theory, the concept of regularity index of uncertain graph and its calculation method are raised with an illustration of the calculation ...
متن کاملRegularity index of uncertain graph
With the increasingly development of system complexity, there is a variety of indeterminacy in the practical applications of graph theory. In this paper, the uncertainty theory is applied to study the regularity of the uncertain graph. Based on the uncertainty theory, the concept of regularity index of uncertain graph and its calculation method are raised with an illustration of the calculation...
متن کاملFinite groups admitting a connected cubic integral bi-Cayley graph
A graph is called integral if all eigenvalues of its adjacency matrix are integers. Given a subset $S$ of a finite group $G$, the bi-Cayley graph $BCay(G,S)$ is a graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid sin S, xin G}$. In this paper, we classify all finite groups admitting a connected cubic integral bi-Cayley graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Indonesian Mathematical Society
سال: 2019
ISSN: 2460-0245,2086-8952
DOI: 10.22342/jims.25.1.607.1-15